منابع مشابه
On-line Sequential Bin Packing
We consider a sequential version of the classical bin packing problem in which items are received one by one. Before the size of the next item is revealed, the decision maker needs to decide whether the next item is packed in the currently open bin or the bin is closed and a new bin is opened. If the new item doesn’t fit, it is lost. If a bin is closed, the remaining free space in the bin accou...
متن کاملLinear time-approximation algorithms for bin packing
Simchi-Levi (Naval Res. Logist. 41 (1994) 579–585) proved that the famous bin packing algorithms FF and BF have an absolute worst-case ratio of no more than 4 , and FFD and BFD have an absolute worst-case ratio of 3 2 , respectively. These algorithms run in time O(n log n). In this paper, we provide a linear time constant space (number of bins kept during the execution of the algorithm is const...
متن کاملOn-Line Extensible Bin Packing with Unequal Bin Sizes
In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and give the complete analysis on a list scheduling algorithm (LS). Namely we present tight bo...
متن کاملBin Packing with Linear Usage Costs
Bin packing is a well studied problem involved in many applications. The classical bin packing problem is about minimising the number of bins and ignores how the bins are utilised. We focus in this paper, on a variant of bin packing that is at the heart of efficient management of data centres. In this context, servers can be viewed as bins and virtual machines as items. The efficient management...
متن کاملTwo-Dimensional On-Line Bin Packing Problem with Rotatable Items
In this paper, we consider a two-dimensional version of the on-line bin packing problem, in which each rectangular item that should be packed into unit square bins is “rotatable” by 90 ◦ . Two on-line algorithms for solving the problem are proposed. The second algorithm is an extension of the 2rst algorithm, and the worst-case ratio of the second one is at least 2.25 and at most 2.565. c © 2002...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1989
ISSN: 0196-6774
DOI: 10.1016/0196-6774(89)90031-x